Structural robustness and transport efficiency of complex networks with degree correlation

نویسنده

  • Toshihiro Tanizawa
چکیده

Toshihiro Tanizawa∗ Kochi National College of Technology, 200-1 Monobe-Otsu, Nankoku, Kochi 783-8508, Japan Abstract We examine two properties of complex networks, the robustness against targeted node removal (attack) and the transport efficiency in terms of degree correlation in node connection by numerical evaluation of exact analytic expressions. We find that, while the assortative correlation enhances the structural robustness against attack, the disassortative correlation significantly improves the transport efficiency of the network under consideration. This finding might shed light on the reason why some networks in the real world prefer assortative correlation and others prefer disassortative one.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degree-correlation, robustness, and vulnerability in finite scale-free networks

Many naturally occurring networks have a power-law degree distribution as well as a non-zero degree correlation. Despite this, most studies analyzing the efficiency of immunization strategies in networks have concentrated only on power-law degree distribution and ignored degree correlation. This study looks specifically at the effect degree-correlation has on the efficiency of several immunizat...

متن کامل

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

Dynamical robustness in complex networks: the crucial role of low-degree nodes

Many social, biological, and technological networks consist of a small number of highly connected components (hubs) and a very large number of loosely connected components (low-degree nodes). It has been commonly recognized that such heterogeneously connected networks are extremely vulnerable to the failure of hubs in terms of structural robustness of complex networks. However, little is known ...

متن کامل

On the influence of topological characteristics on robustness of complex networks

In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, smallworld and random networks, we look at a number of network measures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicab...

متن کامل

Analysis and perturbation of degree correlation in complex networks

Degree correlation is an important topological property common to many real-world networks such as such as the protein-protein interactions and the metabolic networks. In the letter, the statistical measures for characterizing the degree correlation in networks are investigated analytically. We give an exact proof of the consistency for the statistical measures, reveal the general linear relati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1209.4897  شماره 

صفحات  -

تاریخ انتشار 2012